Longstaff and Schwartz models for American Options
نویسنده
چکیده
This thesis consists of two parts. In the first part the Longstaff and Schwartz least squares method (a Monte-Carlo method) for pricing American type options is investigated. The method is based on valuation through a comparison between the value of early exercise and the conditional expected value of continued possession. The result is regressed on a set of basis functions. In this paper the functions are simple polynomials. The results is compared to the results from a finite difference scheme and proves to be reliable. In the second part of the thesis a finite element model is implemented to solve a two factor partial differential equation model, known as the Longstaff and Schwartz two factor equilibrium model. The implementation is first tested against an analytical solution for a simple bond and is then used to price a floorlet (as an example). The model is then expanded with a successive over relaxation solver that can handle obstacle problems to price American type derivatives. An American put option on a bond is priced and compared with the value of a European put option on the same bond and with the same maturity. Implementation of the finite element method 16 3.2.1 Boundary conditions 16 3.2.2 The analytical solution for Bonds and European derivatives 18 3.2.3 Numerical solution using FEM 19 3.2.4 The grid 21 3.2.5 Implementation of the model and simple validations 22 3.2.6 Comparison between analytical and FEM models for the price of a bond 23 3.2.7 Limitations of the implemented model 25 3.3 Results 26 3.3.1 Floors and floorlets 26 3.3.2 American and European put option on a bond 27 4 Discussion 29 Appendix A 30 Bibliography 31 4
منابع مشابه
Assessing Least Squares Monte Carlo for the Kulatilaka Trigeorgis General Real Options Pricing Model
We assess the applicability of (Longstaff and Schwartz, 2001) Least Squares Monte Carlo method (LSMC) to the General Real Options Pricing Model of (Kulatilaka and Trigeorgis, 1994) (KT). We propose some moment matching methods to get comparable results from KT model under different underlying stochastic processes for both LSMC and multivariate lattice methods. We study LSMC under different stoc...
متن کاملConvergence of Monte Carlo Algorithms for Pricing American Options
In this paper we study the convergence of the Longstaff-Schwartz algorithm for the valuation of American options. Our approach is based on empirical risk minimization initiated by Vapnik and Chervonenkis in the early 1970’s and empirical processes techniques. This allows us to prove convergence, derive error estimates and a Central Limit Theorem for the sample estimators. It also opens up a var...
متن کاملPricing Higher-Dimensional American Options Using The Stochastic Grid Method
This paper considers the problem of pricing options with early-exercise features whose payoff depends on several sources of uncertainty. We propose a stochastic grid method for estimating the upper and lower bound values of high-dimensional American options. The method is a hybrid of the least squares method of Longstaff and Schwartz (2001) [22], the stochastic mesh method of Broadie and Glasse...
متن کاملA Longstaff and Schwartz Approach to the Early Election Problem
In many democratic parliamentary systems, election timing is an important decision availed to governments according to sovereign political systems. Prudent governments can take advantage of this constitutional option in order to maximize their expected remaining life in power. The problem of establishing the optimal time to call an election based on observed poll data has been well studied with...
متن کاملOn the existence of an optimal regression complexity in the Least-Squares Monte Carlo (LSM) framework for options pricing
In this paper, we illustrate how to value American-style options using the Least-Squares Monte Carlo (LSM) approach proposed by Longstaff and Schwartz (2001) and investigate whether there exists an optimal regression complexity in the LSM framework for options pricing. In particular, we use the smoothing spline in the regression step, which allows us to control the regression complexity on a co...
متن کامل